Counting Constraints in Flat Array Fragments
نویسندگان
چکیده
We identify a fragment of Presburger arithmetic enriched with free function symbols and cardinality constraints for interpreted sets, which is amenable to automated analysis. We establish decidability and complexity results for such a fragment and we implement our algorithms. The experiments run in discharging proof obligations coming from invariant checking and bounded model-checking benchmarks show the practical feasibility of our decision procedure.
منابع مشابه
Digitally Excited Reconfigurable Linear Antenna Array Using Swarm Optimization Algorithms
This paper describes the synthesis of digitally excited pencil/flat top dual beams simultaneously in a linear antenna array constructed of isotropic elements. The objective is to generate a pencil/flat top beam pair using the excitations generated by the evolutionary algorithms. Both the beams share common variable discrete amplitude excitations and differ in variable discrete phase excitations...
متن کاملModel-Counting Approaches for Nonlinear Numerical Constraints
Model counting is of central importance in quantitative reasoning about systems. Examples include computing the probability that a system successfully accomplishes its task without errors, and measuring the number of bits leaked by a system to an adversary in Shannon entropy. Most previous work in those areas demonstrated their analysis on programs with linear constraints, in which cases model ...
متن کاملA New Compact Ultra-wideband Linear Antenna Array for Target Detection Applications
This paper presents a low-cost compact planar microstrip-fed monopole antenna and its four-element array design for ultra-wideband (UWB) wireless communication and target detection applications, respectively, operating in the frequency span of 3 GHz to 11 GHz. A prototype was fabricated and then measured based on optimal parameters. The results of reflection coefficient (S11) and radiation patt...
متن کاملA Flat Histogram Method for Computing the Density of States of Combinatorial Problems
Consider a combinatorial state space S, such as the set of all truth assignments toN Boolean variables. Given a partition of S, we consider the problem of estimating the size of all the subsets in which S is divided. This problem, also known as computing the density of states, is quite general and has many applications. For instance, if we consider a Boolean formula in CNF and we partition acco...
متن کاملConstraining Modular Inflation in the MSSM from Giant Q-Ball Formation
We discuss constraints on which flat directions can have large vacuum expectation values (VEVs) after inflation. We show that only flat directions which are not charged under B-L and develop positive pressure due to renormalization group effects can have large VEVs of order MPl. For example, within the MSSM only the HuHd flat direction is found to be viable. This strongly constrains the embeddi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016